The Road to Popularity: The Dilution of Growing Audience on Twitter

On social media platforms, like Twitter, users are often interested in gaining more influence and popularity by growing their set of followers, aka their audience. Several studies have described the properties of users on Twitter based on static snapshots of their follower network. Other studies have analyzed the general process of link formation. Here, rather than investigating the dynamics of this process itself, we study how the characteristics of the audience and follower links change as the audience of a user grows in size on the road to user's popularity. To begin with, we find that the early followers tend to be more elite users than the late followers, i.e., they are more likely to have verified and expert accounts. Moreover, the early followers are significantly more similar to the person that they follow than the late followers. Namely, they are more likely to share time zone, language, and topics of interests with the followed user. To some extent, these phenomena are related with the growth of Twitter itself, wherein the early followers tend to be the early adopters of Twitter, while the late followers are late adopters. We isolate, however, the effect of the growth of audiences consisting of followers from the growth of Twitter's user base itself. Finally, we measure the engagement of such audiences with the content of the followed user, by measuring the probability that an early or late follower becomes a retweeter

Heterogeneity shapes groups growth in social online communities

Many complex systems are characterized by broad distributions capturing, for example, the size of firms, the population of cities or the degree distribution of complex networks. Typically this feature is explained by means of a preferential growth mechanism. Although heterogeneity is expected to play a role in the evolution it is usually not considered in the modeling probably due to a lack of empirical evidence on how it is distributed. We characterize the intrinsic heterogeneity of groups in an online community and then show that together with a simple linear growth and an inhomogeneous birth rate it explains the broad distribution of group members.Comment: 5 pages, 3 figure panel

Opinion Dynamics of Learning Agents: Does Seeking Consensus Lead to Disagreement?

We study opinion dynamics in a population of interacting adaptive agents voting on a set of complex multidimensional issues. We consider agents which can classify issues into for or against. The agents arrive at the opinions about each issue in question using an adaptive algorithm. Adaptation comes from learning and the information for the learning process comes from interacting with other neighboring agents and trying to change the internal state in order to concur with their opinions. The change in the internal state is driven by the information contained in the issue and in the opinion of the other agent. We present results in a simple yet rich context where each agent uses a Boolean Perceptron to state its opinion. If there is no internal clock, so the update occurs with asynchronously exchanged information among pairs of agents, then the typical case, if the number of issues is kept small, is the evolution into a society thorn by the emergence of factions with extreme opposite beliefs. This occurs even when seeking consensus with agents with opposite opinions. The curious result is that it is learning from those that hold the same opinions that drives the emergence of factions. This results follows from the fact that factions are prevented by not learning at all from those agents that hold the same opinion. If the number of issues is large, the dynamics becomes trapped and the society does not evolve into factions and a distribution of moderate opinions is observed. We also study the less realistic, but technically simpler synchronous case showing that global consensus is a fixed point. However, the approach to this consensus is glassy in the limit of large societies if agents adapt even in the case of agreement.Comment: 16 pages, 10 figures, revised versio

Trapped lipopolysaccharide and LptD intermediates reveal lipopolysaccharide translocation steps across the Escherichia coli outer membrane

Lipopolysaccharide (LPS) is a main component of the outer membrane of Gram-negative bacteria, which is essential for the vitality of most Gram-negative bacteria and plays a critical role for drug resistance. LptD/E complex forms a N-terminal LPS transport slide, a hydrophobic intramembrane hole and the hydrophilic channel of the barrel, for LPS transport, lipid A insertion and core oligosaccharide and O-antigen polysaccharide translocation, respectively. However, there is no direct evidence to confirm that LptD/E transports LPS from the periplasm to the external leaflet of the outer membrane. By replacing LptD residues with an unnatural amino acid p-benzoyl-L-phenyalanine (pBPA) and UV-photo-cross-linking in E.coli, the translocon and LPS intermediates were obtained at the N-terminal domain, the intramembrane hole, the lumenal gate, the lumen of LptD channel, and the extracellular loop 1 and 4, providing the first direct evidence and “snapshots” to reveal LPS translocation steps across the outer membrane

Attention on Weak Ties in Social and Communication Networks

Granovetter's weak tie theory of social networks is built around two central hypotheses. The first states that strong social ties carry the large majority of interaction events; the second maintains that weak social ties, although less active, are often relevant for the exchange of especially important information (e.g., about potential new jobs in Granovetter's work). While several empirical studies have provided support for the first hypothesis, the second has been the object of far less scrutiny. A possible reason is that it involves notions relative to the nature and importance of the information that are hard to quantify and measure, especially in large scale studies. Here, we search for empirical validation of both Granovetter's hypotheses. We find clear empirical support for the first. We also provide empirical evidence and a quantitative interpretation for the second. We show that attention, measured as the fraction of interactions devoted to a particular social connection, is high on weak ties --- possibly reflecting the postulated informational purposes of such ties --- but also on very strong ties. Data from online social media and mobile communication reveal network-dependent mixtures of these two effects on the basis of a platform's typical usage. Our results establish a clear relationships between attention, importance, and strength of social links, and could lead to improved algorithms to prioritize social media content

Dynamics in online social networks

An increasing number of today's social interactions occurs using online social media as communication channels. Some online social networks have become extremely popular in the last decade. They differ among themselves in the character of the service they provide to online users. For instance, Facebook can be seen mainly as a platform for keeping in touch with close friends and relatives, Twitter is used to propagate and receive news, LinkedIn facilitates the maintenance of professional contacts, Flickr gathers amateurs and professionals of photography, etc. Albeit different, all these online platforms share an ingredient that pervades all their applications. There exists an underlying social network that allows their users to keep in touch with each other and helps to engage them in common activities or interactions leading to a better fulfillment of the service's purposes. This is the reason why these platforms share a good number of functionalities, e.g., personal communication channels, broadcasted status updates, easy one-step information sharing, news feeds exposing broadcasted content, etc. As a result, online social networks are an interesting field to study an online social behavior that seems to be generic among the different online services. Since at the bottom of these services lays a network of declared relations and the basic interactions in these platforms tend to be pairwise, a natural methodology for studying these systems is provided by network science. In this chapter we describe some of the results of research studies on the structure, dynamics and social activity in online social networks. We present them in the interdisciplinary context of network science, sociological studies and computer science.Comment: 17 pages, 4 figures, book chapte

Challenges in Complex Systems Science

FuturICT foundations are social science, complex systems science, and ICT. The main concerns and challenges in the science of complex systems in the context of FuturICT are laid out in this paper with special emphasis on the Complex Systems route to Social Sciences. This include complex systems having: many heterogeneous interacting parts; multiple scales; complicated transition laws; unexpected or unpredicted emergence; sensitive dependence on initial conditions; path-dependent dynamics; networked hierarchical connectivities; interaction of autonomous agents; self-organisation; non-equilibrium dynamics; combinatorial explosion; adaptivity to changing environments; co-evolving subsystems; ill-defined boundaries; and multilevel dynamics. In this context, science is seen as the process of abstracting the dynamics of systems from data. This presents many challenges including: data gathering by large-scale experiment, participatory sensing and social computation, managing huge distributed dynamic and heterogeneous databases; moving from data to dynamical models, going beyond correlations to cause-effect relationships, understanding the relationship between simple and comprehensive models with appropriate choices of variables, ensemble modeling and data assimilation, modeling systems of systems of systems with many levels between micro and macro; and formulating new approaches to prediction, forecasting, and risk, especially in systems that can reflect on and change their behaviour in response to predictions, and systems whose apparently predictable behaviour is disrupted by apparently unpredictable rare or extreme events. These challenges are part of the FuturICT agenda

An Examination of Not-For-Profit Stakeholder Networks for Relationship Management: A Small-Scale Analysis on Social Media

Using a small-scale descriptive network analysis approach, this study highlights the importance of stakeholder networks for identifying valuable stakeholders and the management of existing stakeholders in the context of mental health not-for-profit services. We extract network data from the social media brand pages of three health service organizations from the U.S., U.K., and Australia, to visually map networks of 579 social media brand pages (represented by nodes), connected by 5,600 edges. This network data is analyzed using a collection of popular graph analysis techniques to assess the differences in the way each of the service organizations manage stakeholder networks. We also compare node meta-information against basic topology measures to emphasize the importance of effectively managing relationships with stakeholders who have large external audiences. Implications and future research directions are also discussed

Testing Propositions Derived from Twitter Studies: Generalization and Replication in Computational Social Science

Replication is an essential requirement for scientific discovery. The current study aims to generalize and replicate 10 propositions made in previous Twitter studies using a representative dataset. Our findings suggest 6 out of 10 propositions could not be replicated due to the variations of data collection, analytic strategies employed, and inconsistent measurements. The study’s contributions are twofold: First, it systematically summarized and assessed some important claims in the field, which can inform future studies. Second, it proposed a feasible approach to generating a random sample of Twitter users and its associated ego networks, which might serve as a solution for answering social-scientific questions at the individual level without accessing the complete data archive.published_or_final_versio